Leximin Asymmetric Multiple Objective DCOP on Factor Graph
نویسندگان
چکیده
1 Nagoya Institute of Technology, Gokiso-cho Showa-ku Nagoya 466-8555, Japan {matsui.t, matsuo}@nitech.ac.jp 2 Florida Institute of Technology, Melbourne FL 32901, United States of America [email protected] 3 Kobe University, 5-1-1 Fukaeminami-machi Higashinada-ku Kobe 658-0022, Japan {tenda, hirayama}@maritime.kobe-u.ac.jp 4 Kyushu University, 744 Motooka Nishi-ku Fukuoka 819-0395, Japan [email protected]
منابع مشابه
Leximin Multiple Objective DCOPs on Factor Graphs for Preferences of Agents
Distributed Constraint Optimization Problem (DCOP) has been studied as a fundamental component of multiagent systems. With DCOPs, various applications on multiagent systems are formalized as constraint optimization problems where variables and functions are distributed among agents. Leximin AMODCOP has been proposed as a class of Multiple Objective DCOPs, where multiple objectives for individua...
متن کاملConstraint Composite Graph-Based Lifted Message Passing for Distributed Constraint Optimization Problems
The Distributed Constraint Optimization Problem (DCOP) offers a powerful approach for the description and resolution of cooperative multi-agent problems. In this model, a group of agents coordinates their actions to optimize a global objective function, taking into account their local preferences. In the majority of DCOP algorithms, agents operate on three main graphical representations of the ...
متن کاملPrivacy Preserving Implementation of the Max-Sum Algorithm and its Variants
One of the basic motivations for solving DCOPs is maintaining agents’ privacy. Thus, researchers have evaluated the privacy loss of DCOP algorithms and defined corresponding notions of privacy preservation for secured DCOP algorithms. However, no secured protocol was proposed for Max-Sum, which is among the most studied DCOP algorithms. As part of the ongoing effort of designing secure DCOP alg...
متن کاملMax-Sum Goes Private
As part of the ongoing effort of designing secure DCOP algorithms, we propose P-MAX-SUM, the first private algorithm that is based on MAX-SUM. The proposed algorithm has multiple agents preforming the role of each node in the factor graph, on which the MAX-SUM algorithm operates. P-MAXSUM preserves three types of privacy: topology privacy, constraint privacy, and assignment/decision privacy. By...
متن کاملThe Asymmetric Leximin Solution
In this article we define and characterize a class of asymmetric leximin solutions, that contains both the symmetric leximin solution of Imai [5] and the two-person asymmetric Kalai-Smorodinsky solution of Dubra [3] as special cases. Solutions in this class combine three attractive features: they are defined on the entire domain of convex n-person bargaining problems, they generally yield Paret...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015